Weaker Axioms, More Ranges
نویسندگان
چکیده
In the family of many-valued modal languages proposed by M. Fitting in 1992, every modal language is based on an underlying Heyting algebra which provides the space of truth values. The lattice of truth values is explicitly represented in the language by a set of special constants and this allows for forming weak, generalized, many-valued analogs of all classical modal axioms. Weak axioms of this kind have been recently investigated from the canonicity, completeness and correspondence perspective. In this paper, we provide some results on the effect of adopting weak versions of the axioms D, T, 4, 5 and w5 in the family of many-valued modal non-monotonic logics, à la McDermott and Doyle, introduced in [4] and further investigated in [7]. For many-valued modal languages built on finite chains, we extend the results of [7] by proving two quite general range theorems. We then hint on the relation between the modal non-monotonic logics obtained: we prove that there exist ranges which selectively pick out some of the expansions produced by the many-valued autoepistemic logics introduced in [4, 9], actually the ones with a confidence-bounded set of beliefs. However, an exact characterization of the relation between the various ranges created by the weak many-valued modal axioms still remains to be explored.
منابع مشابه
On characterizations of the fully rational fuzzy choice functions
In the present paper, we introduce the fuzzy Nehring axiom, fuzzy Sen axiom and weaker form of the weak fuzzycongruence axiom. We establish interrelations between these axioms and their relation with fuzzy Chernoff axiom. Weexpress full rationality of a fuzzy choice function using these axioms along with the fuzzy Chernoff axiom.
متن کاملFinding paths through narrow and wide trees
We consider two axioms of second-order arithmetic. These axioms assert, in two different ways, that infinite but narrow binary trees always have infinite paths. We show that both axioms are strictly weaker than Weak König’s Lemma, and incomparable in strength to the dual statement (WWKL) that wide binary trees have paths.
متن کاملA Note on Quasi-metric Spaces
In the present note it is shown that a very useful generalized distance function may be defined in certain of these spaces. Clearly, any such distance function must be an asymmetric one. W. A. Wilson considered the definition of asymmetric distances in certain spaces which satisfy stronger separation axioms than K. I t is shown here that a slight modification of one of the axioms in [W] allows ...
متن کاملOn the Nonexistence of Resilient Consensus Protocols
In [3], Fischer, Lynch and Paterson proved that in asynchronous message passing systems there cannot exist a consensus protocol that tolerates even a single undetectable crash failure. Their proof of this fundamental result relies on operational details such as sending and receiving messages, etc. Chandy and Misra [1] have taken an axiomatic non-operational approach to the consensus problem. Th...
متن کاملOn exchange properties for Coxeter matroids and oriented matroids
We introduce new basis exchange axioms for matroids and oriented matroids. These new axioms are special cases of exchange properties for a more general class of combinatorial structures, Coxeter matroids. We refer to them as “properties” in the more general setting because they are not all equivalent, as they are for ordinary matroids, since the Symmetric Exchange Property is strictly stronger ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fundam. Inform.
دوره 51 شماره
صفحات -
تاریخ انتشار 2002